A Randomized Approximation Convex Hull Algorithm for High Dimensions
نویسندگان
چکیده
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملRandomized Parallel 3D Convex Hull Algorithm
This paper presents a randomize, coarse-grained, parallel algorithm which computes the 3-dimensional convex hull of a set of points with high probability in O(n log n p) time, where n is the number of points, and p is the number of processors. Furthermore, O(1) communication steps are used, with O(n=p) data sent at each step, by each processor. The material presented in this paper summarizes th...
متن کاملSpeculative Parallelization of a Randomized Incremental Convex Hull Algorithm
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the development of complex data structures or hard to implement algorithms. Randomized algorithms appear in this scenario as a very useful tool in order to obtain easier implementations within a good expected time bound. H...
متن کاملFast approximation of convex hull
The construction of a planar convex hull is an essential operation in computational geometry. It has been proven that the time complexity of an exact solution is Ω(NlogN). In this paper, we describe an algorithm with time complexity O(N + k), where k is parameter controlling the approximation quality. This is beneficial for applications processing a large number of points without necessity of a...
متن کاملA GPU Algorithm for Convex Hull
We present a novel algorithm to compute the convex hull of a point set in R using the graphics processing unit (GPU). By exploiting the relationship between the Voronoi diagram and the convex hull, we derive the answer from the former. Our algorithm only requires a few simple atomic operations and does not need explicit locking or any other concurrency control mechanism, thus it can maximize th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2015
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2015.08.119